package leetcode.biweekly.week86;

import java.util.HashSet;
import java.util.Set;

//Solution1Test
public class Solution1 {
	
    public boolean findSubarrays(int[] nums) {
    	Set<Integer> set = new HashSet<>();
    	for (int i = 1; i < nums.length; i++) {
			int sum = nums[i] + nums[i-1];
			if(set.contains(sum)) {
				return true;
			}
			set.add(sum);
		}
    	return false;
    }
	
}
